Solving Shortest Path Problems by Adaptable Independent-minded Particle Swarm Optimization

This study proposes a method of solving the shortest path problem (SPP) using the adaptable independent-minded particle swarm optimization (AIPSO). The system of AIPSO is almost the same as PSO, however, a connection relationship between particles of AIPSO dynamically changes with each iteration. We apply the proposed method using AIPSO to solving two kinds of SPPs derived by the Small-world network and the Waxman network. We confirm that AIPSO can significantly improve the optimization performance from the basic PSO.